-
1 key distribution algorithm
Безопасность: алгоритм распределения ключейУниверсальный англо-русский словарь > key distribution algorithm
-
2 key distribution algorithm
Англо-русский словарь по компьютерной безопасности > key distribution algorithm
-
3 algorithm
алгоритм (cryptoalgorithm) криптографический алгоритм, криптоалгоритм; алгоритм шифрования (криптографического закрытия)- private cryptographic algorithmАнгло-русский словарь по компьютерной безопасности > algorithm
См. также в других словарях:
Key authentication — is a problem that arises when using public key cryptography. It is the process of assuring that the public key of person A held by person B does in fact belong to person A .In traditional symmetric key cryptography, this problem wasn t an issue… … Wikipedia
Key (cryptography) — In cryptography, a key is a piece of information (a parameter) that determines the functional output of a cryptographic algorithm or cipher. Without a key, the algorithm would produce no useful result. In encryption, a key specifies the… … Wikipedia
Key server (cryptographic) — In computer security, a key server is a computer mdash; typically running special software mdash; which provides cryptographic keys to users or other programs. The users programs can be working on the same network as the key server or on another… … Wikipedia
Distribution mangagement system — SCADA systems have been a part of utility automation for at least 15 years and contributing to the decision making process of the control rooms. However, majority of the existing solutions are closely related to distribution network data… … Wikipedia
Key schedule — In cryptography, the so called product ciphers are a certain kind of ciphers, where the (de )ciphering of data is done in rounds . The general setup of each round is the same, except for some hard coded parameters and a part of the cipher key,… … Wikipedia
Public-key cryptography — In an asymmetric key encryption scheme, anyone can encrypt messages using the public key, but only the holder of the paired private key can decrypt. Security depends on the secrecy of that private key … Wikipedia
Diffie–Hellman key exchange — (D–H)[nb 1] is a specific method of exchanging keys. It is one of the earliest practical examples of key exchange implemented within the field of cryptography. The Diffie–Hellman key exchange method allows two parties that have no prior knowledge … Wikipedia
Symmetric-key algorithm — Symmetric key algorithms are a class of algorithms for cryptography that use trivially related, often identical, cryptographic keys for both decryption and encryption.The encryption key is trivially related to the decryption key, in that they may … Wikipedia
Diffie-Hellman key exchange — (D H) is a cryptographic protocol that allows two parties that have no prior knowledge of each other to jointly establish a shared secret key over an insecure communications channel. This key can then be used to encrypt subsequent communications… … Wikipedia
Deutsch–Jozsa algorithm — The Deutsch–Jozsa algorithm is a quantum algorithm, proposed by David Deutsch and Richard Jozsa in 1992[1] with improvements by Richard Cleve, Artur Ekert, Chiara Macchiavello, and Michele Mosca in 1998.[2] Although it is of little practical use … Wikipedia
Sorting algorithm — In computer science, a sorting algorithm is an algorithm that puts elements of a list in a certain order. The most used orders are numerical order and lexicographical order. Efficient sorting is important for optimizing the use of other… … Wikipedia